A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization
نویسندگان
چکیده
A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization Viviana Cocco Mariani a,∗, Leandro dos Santos Coelho b a Department of Mechanical Engineering, Pontifical Catholic University of Parana, Imaculada Conceição, 1155, Zip code 80215-910, Curitiba, PR, Brazil b Industrial and Systems Engineering Graduate Program, Pontifical Catholic University of Parana, Imaculada Conceição, 1155, Zip code 80215-910, Curitiba, PR, Brazil
منابع مشابه
Optimum Parameters for Tuned Mass Damper Using Shuffled Complex Evolution (SCE) Algorithm
This study is investigated the optimum parameters for a tuned mass damper (TMD) under the seismic excitation. Shuffled complex evolution (SCE) is a meta-heuristic optimization method which is used to find the optimum damping and tuning frequency ratio for a TMD. The efficiency of the TMD is evaluated by decreasing the structural displacement dynamic magnification factor (DDMF) and acceleration ...
متن کاملHybridizing Shuffled Frog Leaping and Shuffled Complex Evolution Algorithms Using Local Search Methods
In this research, a study was carried out to exploit the hybrid schemes combining two classical local search techniques i.e. Nelder–Mead simplex search method and bidirectional random optimization with two metaheuristic methods i.e. the shuffled frog leaping and the shuffled complex evolution, respectively. In this hybrid methodology, each subset of meta-heuristic algorithms is improved by a hy...
متن کاملApplication of Shuffled Complex Evolution Optimization Approach to Concrete Pavement Backanalysis
This paper focuses on the development of a new backcalculation method for concrete pavements based on a hybrid evolutionary global optimization algorithm, namely Shuffled Complex Evolution (SCE). Evolutionary optimization algorithms are ideally suited for intrinsically multi-modal, non-convex, and discontinuous realworld problems such as pavement backcalculation because of their ability to expl...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics and Computers in Simulation
دوره 81 شماره
صفحات -
تاریخ انتشار 2011